Rank-based variable selection
نویسندگان
چکیده
This note considers variable selection in the robust linear model via R-estimates. The proposed rank-based approach is a generalization of the penalized least squares estimators where we replace the least squares loss function with Jaeckel’s (1972) dispersion function. Our rank-based method is robust to outliers in the errors and has roots in traditional nonparametric statistics for simple location-shift problems. We establish the theoretical properties of our estimators which ensure desirable asymptotic behaviour of setting coefficient estimates to zero for unimportant variables and consistently estimating coefficients for important variables. Numerical studies indicate that the rank-based methods perform well for both lightand heavy-tailed error distributions.
منابع مشابه
Robust Signed-Rank Variable Selection in Linear Regression
The growing need for dealing with big data has made it necessary to find computationally efficient methods for identifying important factors to be considered in statistical modeling. In the linear model, the Lasso is an effective way of selecting variables using penalized regression. It has spawned substantial research in the area of variable selection for models that depend on a linear combina...
متن کاملA Robust Rerank Approach for Feature Selection and Its Application to Pooling-Based GWA Studies
Large-p-small-n datasets are commonly encountered in modern biomedical studies. To detect the difference between two groups, conventional methods would fail to apply due to the instability in estimating variances in t-test and a high proportion of tied values in AUC (area under the receiver operating characteristic curve) estimates. The significance analysis of microarrays (SAM) may also not be...
متن کاملSpatial Design for Knot Selection in Knot-Based Low-Rank Models
Analysis of large geostatistical data sets, usually, entail the expensive matrix computations. This problem creates challenges in implementing statistical inferences of traditional Bayesian models. In addition,researchers often face with multiple spatial data sets with complex spatial dependence structures that their analysis is difficult. This is a problem for MCMC sampling algorith...
متن کاملSparse Reduced-Rank Regression for Simultaneous Dimension Reduction and Variable Selection in Multivariate Regression
The reduced-rank regression is an effective method to predict multiple response variables from the same set of predictor variables, because it can reduce the number of model parameters as well as take advantage of interrelations between the response variables and therefore improve predictive accuracy. We propose to add a new feature to the reduced-rank regression that allows selection of releva...
متن کاملDiscussion of “Latent Variable Graphical Model Selection via Convex Optimization”
We wish to congratulate the authors for their innovative contribution, which is bound to inspire much further research. We find latent variable model selection to be a fantastic application of matrix decomposition methods, namely, the superposition of low-rank and sparse elements. Clearly, the methodology introduced in this paper is of potential interest across many disciplines. In the followin...
متن کامل